Implementing an Algorithm for Solving Block Hessenberg Systems Implementing an Algorithm for Solving Block Hessenberg Systems

This paper describes the implementation of a recursive descent method for solving block Hessenberg systems. Although the algorithm is conceptually simple, its implementation in C (a natural choice of language given the recursive nature of the algorithm and its data) is nontrivial. Particularly important is the balance between ease of use, computational eeciency, and exibility. This report and the programs it documents are available by anonymous ftp from thales.cs.umd.edu in the directory pub/reports. ABSTRACT This paper describes the implementation of a recursive descent method for solving block Hessenberg systems. Although the algorithm is conceptually simple, its implementation in C (a natural choice of language given the recursive nature of the algorithm and its data) is nontrivial. Particularly important is the balance between ease of use, computational eeciency, and exibility.